On the lines which intersect three given lines in space
نویسندگان
چکیده
منابع مشابه
Lines Through Segments in Three Dimensional Space
Given a set S of n line segments in three-dimensional space, finding all the lines that si-multaneously intersect at least of line segments in S is a fundamental problem that arises ina variety of domains including computer graphics, computer vision, robotics and automation,to mention a few. We refer to this problem as the lines-through-segments problem, or LTS forshort. We pres...
متن کاملOn Varieties Which Are Uniruled by Lines
Using the ♯-minimal model program of uniruled varieties we show that for any pair (X,H) consisting of a reduced and irreducible variety X of dimension k ≥ 3 and a globally generated big line bundle H on X with d := H and n := h(X,H) − 1 such that d < 2(n− k)− 4, then X is uniruled of H-degree one, except if (k, d, n) = (3, 27, 19) and a ♯-minimal model of (X,H) is (P3,OP3(3)). We also show that...
متن کاملLines Tangent to Four Triangles in Three-Dimensional Space
We investigate the lines tangent to four triangles in R3. By a construction, there can be as many as 62 tangents. We show that there are at most 162 connected components of tangents, and at most 156 if the triangles are disjoint. In addition, if the triangles are in (algebraic) general position, then the number of tangents is finite and it is always even.
متن کاملInvariants of Lines in Space
This paper describes a pair of projectivity invariants of four lines in three dimensional projective space, P. Invariants are derived in both algebraic and geometric terms, and the connection between the two ways of defining the invariants is established. Since a count of the number of degrees of freedom would predict the existence of a single invariant, rather that the two that are shown to ex...
متن کاملThe Shortest Path of Touring Lines given in the Plane
Given two points p, q and a sequence of n lines (n>1) in the plane, we want to find the shortest path of touring all the given lines that starts at p and ends at q. In this paper, we solve the problem by reducing it to the problem of finding the shortest path that tours all the segments in a convex polygon from p to q. We first introduce how to construct the convex polygon. Then, we propose the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 1907
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091500036506